Lean Induction Principles for Tableaux
نویسندگان
چکیده
In this paper, we deal with various induction principles incorporated in an underlying tableau calculus with equality. The induction formulae are restricted to literals. Induction is formalized as modiied closure conditions which are triggered by applications of the-rule. Examples dealing with (weak forms of) arithmetic and strings illustrate the simplicity and usability of our induction handling. We prove the correct-ness of the closure conditions and discuss possibilities to strengthen the induction principles.
منابع مشابه
Developing Goodson’s model for rapid performance assessment of emergency department
Over the past years, raising costs of health care in most countries cause to attract more attention to different aspects in the field. One of the best improvement methodologies known in literature is based on lean principles. The main aim of this methodology is to create values in the system by eliminating losses and creating continuous efforts toward improvement. Therefore, by measuring the pe...
متن کاملFree Variable Tableaux for Propositional Modal Logics Universit at Karlsruhe Fakult at F Ur Informatik Free Variable Tableaux for Propositional Modal Logics
We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain \free" and \universal" variables. Our \lean" Prolog implementation is not only surprisingly short, but compares favourably with other considerably more complex implementations for modal deduction.
متن کاملA Lean Manufacturing Roadmap for an Automotive Body Assembly Line within Axiomatic Design Framework
In this paper we are to present a practical application of Axiomatic Design (AD) methodology, as a roadmap to lean production, in redesigning a car body assembly line. Axiomatic Design theory provides a framework to simplify the whole problem. According to the AD principles, a hierarchical structure has been developed. The developed structure originated in lean manufacturing principles and exis...
متن کاملLeant a P: Lean Tableau-based Theorem Proving
implements a rst-order theorem prover based on free-variable semantic tableaux. It is complete, sound, and eecient.
متن کاملKLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning
We present KLMLean 2.0, a theorem prover for propositional KLM logics of nonmonotonic reasoning. KLMLean 2.0 implements some analytic tableaux calculi for these logics recently introduced. KLMLean 2.0 is inspired by the “lean” methodology, it is implemented in SICStus Prolog and it also contains a graphical interface written in Java.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997